AN ALTERNATIVE SPECIFICATION FOR MODELING GROUNDWATER DYNAMICS

This research extends previous work with dynamic models to manage groundwater quality by using the consumptive nitrate use rate instead of the nitrate application rate. The analysis indicates that misspecification results in overestimation of economic benefits, and supra-optimum nitrogen fertilizer application rates and groundwater nitrate stocks at a steady state.     

基于SPA的双枝模糊决策分析

将集对理论(SPA)与双枝模糊决策理论相结合,用集对分析的方法研究进行双枝模糊决策的方法,分别对双枝模糊决策因素域和双枝模糊决策的上枝、下枝和双枝进行了集对分析,给出了用SPA进行双枝模糊决策的性质,同时讨论了双枝模糊决策的动态分析方法,以及双枝模糊决策度强弱态势预测的方法,从而为双枝模糊决策理论的研究提供了新的视角和方法,为双枝模糊决策的应用提供了更方便的工具和更强的理论支持。     

Existence of two solutions of m-point boundary value problem for second order dynamic equations on time scales

In this paper, by means of a new twin fixed-point theorem in a cone, the existence of at least two positive solutions of m-point boundary value problem for second order dynamic equations on time scales is considered.     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

Surface profile measurement of low-frequency vibrating objects using temporal analysis of fringe pattern

A simple and accurate algorithm (phase scanning method) is proposed for 3D surface contouring and dynamic response determination of a vibrating object. A sinusoidal fringe pattern is projected onto a low-frequency vibrating object by a programmable liquid crystal display projector. The fringe patterns are captured by a high-speed CCD camera with a telecentric gauging lens. Phase values are evaluated point by point using phase scanning method. From the phase values of each point on the object, the contour of the specimen at different instants of vibration can be retrieved. In this paper, a small vibrating coin is used to demonstrate the validity of the method and the experimental results are compared with test results on a stationary coin using four-step phase shifting and fast Fourier transform methods. The technique is especially useful in applications where the vibrating object has a complicated shape.     

Optimal stopping problems by two or more decision makers: a survey

A review of the optimal stopping problem with more than a single decision maker (DM) is presented in this paper. We classify the existing literature according to the arrival of the offers, the utility of the DMs, the length of the sequence of offers, the nature of the game and the number of offers to be selected. We enumerate various definitions for this problem and describe some dynamic approaches. Fouad Ben Abdelaziz is on leave from the Institut Superieur de Gestion, University of Tunis, Tunisia e-mail: foued.benabdelaz@isg.run.tn.     

Optimal production control of a dynamic two-product manufacturing system with setup costs and setup times

This paper deals with the optimal control of a one-machine two-product manufacturing system with setup changes, operating in a continuous time dynamic environment. The system is deterministic. When production is switched from one product to the other, a known constant setup time and a setup cost are incurred. Each product has specified constant processing time and constant demand rate, as well as an infinite supply of raw material. The problem is formulated as a feedback control problem. The objective is to minimize the total backlog, inventory and setup costs incurred over a finite horizon. The optimal solution provides the optimal production rate and setup switching epochs as a function of the state of the system (backlog and inventory levels). For the steady state, the optimal cyclic schedule is determined. To solve the transient case, the system's state space is partitioned into mutually exclusive regions such that with each region, the optimal control policy is determined analytically.     

Anisotropic elastodynamics in a half space: An analytic method for polynomial data

An initial boundary value problem for the dynamic system of anisotropic elasticity in a half space is studied in the paper. A novel method of finding an exact solution of this problem for a special polynomial form of initial data and inhomogeneous term of the system is described. On the base of this method the simulation of elastic waves in different homogeneous anisotropic half spaces is implemented.     

A floating-point genetic algorithm for solving the unit commitment problem

This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems.